The local metric dimension of generalized broken fan graph and edge corona product of star graph and path graph
نویسندگان
چکیده
منابع مشابه
dynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولAdjacency metric dimension of the 2-absorbing ideals graph
Let Γ=(V,E) be a graph and W_(a)={w_1,…,w_k } be a subset of the vertices of Γ and v be a vertex of it. The k-vector r_2 (v∣ W_a)=(a_Γ (v,w_1),… ,a_Γ (v,w_k)) is the adjacency representation of v with respect to W in which a_Γ (v,w_i )=min{2,d_Γ (v,w_i )} and d_Γ (v,w_i ) is the distance between v and w_i in Γ. W_a is called as an adjacency resolving set for Γ if distinct vertices of ...
متن کاملTHE (△,□)-EDGE GRAPH G△,□ OF A GRAPH G
To a simple graph $G=(V,E)$, we correspond a simple graph $G_{triangle,square}$ whose vertex set is ${{x,y}: x,yin V}$ and two vertices ${x,y},{z,w}in G_{triangle,square}$ are adjacent if and only if ${x,z},{x,w},{y,z},{y,w}in Vcup E$. The graph $G_{triangle,square}$ is called the $(triangle,square)$-edge graph of the graph $G$. In this paper, our ultimate goal is to provide a link between the ...
متن کاملThe edge tenacity of a split graph
The edge tenacity Te(G) of a graph G is dened as:Te(G) = min {[|X|+τ(G-X)]/[ω(G-X)-1]|X ⊆ E(G) and ω(G-X) > 1} where the minimum is taken over every edge-cutset X that separates G into ω(G - X) components, and by τ(G - X) we denote the order of a largest component of G. The objective of this paper is to determine this quantity for split graphs. Let G = (Z; I; E) be a noncomplete connected split...
متن کاملstudying the corona product of graphs under some graph invariants
the corona product $gcirc h$ of two graphs $g$ and $h$ isobtained by taking one copy of $g$ and $|v(g)|$ copies of $h$;and by joining each vertex of the $i$-th copy of $h$ to the$i$-th vertex of $g$, where $1 leq i leq |v(g)|$. in thispaper, exact formulas for the eccentric distance sum and the edgerevised szeged indices of the corona product of graphs arepresented. we also study the conditions...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2019
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1306/1/012015